Nondeterministic Algebraic Speciications in Relational Syntax
نویسنده
چکیده
Relational syntax is presented for nondeterministic algebraic spec-iications called the language of relational terms. It is shown how non-deterministic speciications can be translated to the relational terms. A complete inference system is presented for derivation of valid clauses of relational atoms. Finally, a-abstraction construct is introduced extending the syntax of relational terms. It is weaker than the functional-abstraction, but allows translation of rst-order predicate language into the language of relational terms. A slight extension of the inference system remains sound and complete for this extended syntax.
منابع مشابه
Prototyping Relational Speciications and Programs with Relview
Based on the representation of relations as Boolean matrices, relational speciications { in our context relation algebraic terms { can be prototyped using the RELVIEW system. Transformational techniques allow to derive eecient programs from these relational speciications which again can be prototyped with RELVIEW. The powerful relational calculus can be used to prove required properties for ass...
متن کاملGraphical Integrated Development Environment for Larch Speciications Graphical Integrated Development Environment for Larch Speciications
Formal methods are playing an increasingly important role in software development. The use of algebraic languages to formally specify software systems provides a better understanding of the functionality of the software and aids in ensuring the correctness and reliability of the software. However, to ensure software correctness and completeness, the formal speciication of the system must rst be...
متن کاملRelational Algebraic Semantics of Deterministic and Nondeterministic Programs
Abstract relational algebra is proposed as a practical means to describe the denotational semantics of programming languages. We apply this method of semantics description to a functional language and demonstrate the usefulness of this approach by some examples. In particular, we prove the correctness of a program transformation rule within our calculus. Then, the deterministic language DFP is ...
متن کاملCentrum Voor Wiskunde En Informatica Reportrapport Origin Tracking in Primitive Recursive Schemes Origin Tracking in Primitive Recursive Schemes
Algebraic speciications of programming languages can be used to generate language-speciic programming support tools. Some of these can be obtained in a straightforward way by executing language speciications as term rewriting systems. More advanced tools can be obtained if the term rewriting machinery is extended with origin tracking. Origin tracking is a technique which automatically establish...
متن کاملOrigin Tracking in Primitive Recursive Schemes
Algebraic speciications of programming languages can be used to generate language-speciic programming support tools. Some of these can be obtained in a straightforward way by executing language speciications as term rewriting systems. More advanced tools can be obtained if the term rewriting machinery is extended with origin tracking. Origin tracking is a technique which automatically establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995